Program Size Complexity for Possibly Infinite Computations
نویسندگان
چکیده
منابع مشابه
Program Size Complexity for Possibly Infinite Computations
We define a program size complexity function H∞ as a variant of the prefix-free Kolmogorov complexity, based on Turing monotone machines performing possibly unending computations. We consider definitions of randomness and triviality for sequences in {0, 1} relative to the H∞ complexity. We prove that the classes of Martin-Löf random sequences and H∞-random sequences coincide, and that the H∞-tr...
متن کاملKolmogorov Complexity for Possibly Infinite Computations
In this paper we study the Kolmogorov complexity for non-effective computations, that is, either halting or non-halting computations on Turing machines. This complexity function is defined as the length of the shortest inputs that produce a desired output via a possibly non-halting computation. Clearly this function gives a lower bound of the classical Kolmogorov complexity. In particular, if t...
متن کاملRecursion and Topology on 2≤ω for Possibly Infinite Computations
In the context of possibly infinite computations yielding finite or infinite (binary) outputs, the space 2≤ω = 2∗∪2ω appears to be one of the most fundamental spaces in Computer Science. Though underconsidered, next to 2, this space can be viewed (§3.5.2) as the simplest compact space native to computer science. In this paper we study some of its properties involving topology and computability....
متن کاملRandom reals and possibly infinite computations Part I: Randomness in ∅'
Using possibly infinite computations on universal monotone Turing machines, we prove Martin-Löf randomness in ∅′ of the probability that the output be in some set O ⊆ 2≤ω under complexity assumptions about O. 1 Randomness in the spirit of Rice’s theorem for computability Let 2∗ be the set of all finite strings in the binary alphabet 2 = {0, 1}. Let 2ω be the set of all infinite binary sequences...
متن کاملLISP Program - Size Complexity II
We present the information-theoretic incompleteness theorems that arise in a theory of program-size complexity based on something close to real LISP. The complexity of a formal axiomatic system is defined to be the minimum size in characters of a LISP definition of the proofchecking function associated with the formal system. Using this concrete and easy to understand definition, we show (a) th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Notre Dame Journal of Formal Logic
سال: 2005
ISSN: 0029-4527
DOI: 10.1305/ndjfl/1107220673